Exploiting Overlap When Searching for Robust Optima

نویسندگان

  • Johannes W. Kruisselbrink
  • Michael T. M. Emmerich
  • André H. Deutz
  • Thomas Bäck
چکیده

This paper introduces a new view on fitness evaluation when searching for robust optima. It proposes to compare solutions in (successive) populations with respect to how they rank in robustness instead of aiming for accurate robustness estimates. This can be done by focusing on the non-overlapping parts of the regions of uncertainty of each pair of candidate solutions. An initial step toward a scheme implementing this view is made with the analysis and experiments on a simple scenario comparing two solutions on uniform input noise.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Index-based map-to-sequence alignment in large eukaryotic genomes

Resolution of complex repeat structures and rearrangements in the assembly and analysis of large eukaryotic genomes is often aided by a combination of high-throughput sequencing and mapping technologies (e.g. optical restriction mapping). In particular, mapping technologies can generate sparse maps of large DNA fragments (150 kbp–2 Mbp) and thus provide a unique source of information for disamb...

متن کامل

OPTIMA: sensitive and accurate whole-genome alignment of error-prone genomic maps by combinatorial indexing and technology-agnostic statistical analysis

BACKGROUND Resolution of complex repeat structures and rearrangements in the assembly and analysis of large eukaryotic genomes is often aided by a combination of high-throughput sequencing and genome-mapping technologies (for example, optical restriction mapping). In particular, mapping technologies can generate sparse maps of large DNA fragments (150 kilo base pairs (kbp) to 2 Mbp) and thus pr...

متن کامل

Trade-off between Optimality and Robustness: An Evolutionary Multiobjective Approach

In real-world applications, it is often desired that a solution is not only of high performance, but also of strong robustness. In evolutionary optimization, robust optimal solutions can be obtained either by averaging the fitness in the neighborhood or by perturbing the design variables in fitness evaluations. Unfortunately, only one solution can usually be obtained from one run of optimizatio...

متن کامل

A Robust Archived Differential Evolution Algorithm for Global Optimization Problems

A robust archived differential evolution algorithm is put forward by means of embedding a flexibility processing operator and an efficiency processing operator based on original DE and ADE. A special constraint-handling mechanism based on dynamic penalty functions and fitness calculation of individuals is adopted in the proposed method to deal with various constraints effectively, which is furt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010